Labeling the Regions of the Type Cn Shi Arrangement
نویسنده
چکیده
The number of regions of the type Cn Shi arrangement in Rn is (2n + 1)n. Strikingly, no bijective proof of this fact has been given thus far. The aim of this paper is to provide such a bijection and use it to prove more refined results. We construct a bijection between the regions of the type Cn Shi arrangement in Rn and sequences a1a2 . . . an, where ai ∈ {−n,−n+1, . . . ,−1, 0, 1, . . . , n−1, n}, i ∈ [n]. Our bijection naturally restrict to bijections between special regions of the arrangement and sequences with a given number of distinct elements.
منابع مشابه
A bijection between dominant Shi regions and core partitions
It is well-known that Catalan numbers Cn = 1 n+1 ( 2n n ) count the number of dominant regions in the Shi arrangement of type A, and that they also count partitions which are both n-cores as well as (n + 1)-cores. These concepts have natural extensions, which we call here the m-Catalan numbers and m-Shi arrangement. In this paper, we construct a bijection between dominant regions of the m-Shi a...
متن کاملA bijection between (bounded) dominant Shi regions and core partitions
It is well-known that Catalan numbers Cn = 1 n+1 ( 2n n ) count the number of dominant regions in the Shi arrangement of type A, and that they also count partitions which are both n-cores as well as (n + 1)-cores. These concepts have natural extensions, which we call here the m-Catalan numbers and m-Shi arrangement. In this paper, we construct a bijection between dominant regions of the m-Shi a...
متن کاملOrientations, Semiorders, Arrangements, and Parking Functions
It is known that the Pak-Stanley labeling of the Shi hyperplane arrangement provides a bijection between the regions of the arrangement and parking functions. For any graph G, we define the G-semiorder arrangement and show that the Pak-Stanley labeling of its regions produces all G-parking functions. In his study of Kazhdan-Lusztig cells of the affine Weyl group of typeAn−1, [10], J.-Y. Shi int...
متن کاملFurther results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013